The Complexity of Timetable Construction Problems

نویسندگان

  • Tim B. Cooper
  • Jeffrey H. Kingston
چکیده

This paper shows that timetable construction is NP-complete in a number of quite different ways that arise in practice, and discusses the prospects of overcoming these problems. A formal specification of the problem based on TTL, a timetable specification language, is given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timetable Construction: The Algorithms and Complexity Perspective (Plenary Talk)

This paper advocates approaching timetable construction from the algorithms and complexity perspective, in which analysis of the specific problem under study is used to find efficient algorithms for some of its aspects, or to relate it to other problems. Examples are given of problem analyses leading to relaxations, phased approaches, very large-scale neighbourhood searches, bipartite matchings...

متن کامل

The effect of language complexity and group size on knowledge construction: Implications for online learning

This  study  investigated  the  effect  of  language  complexity  and  group  size  on  knowledge construction in two online debates. Knowledge construction was assessed using Gunawardena et al.’s Interaction Analysis Model (1997). Language complexity was determined by dividing the  number  of  unique  words  by  total  words.  It  refers  to  the  lexical  variation.  The  results showed  that...

متن کامل

Combining Examinations to Accelerate Timetable Construction

In this paper we propose a novel approach that combines compatible examinations in order to accelerate both the initial timetable construction, as well as a later search. The conditions for combining exams are described, and we show that we are able to offer some guarantees as to the quality of solutions that remain in the reduced search space. The approach is applied to one of the standard ben...

متن کامل

Constraint Priorities - a Way of Getting an Optimal Timetable Fully Automatically. - Demo Storyboard

The www.school-timetable.eu system is a modern fully automated timetable scheduler based on constraint priorities. This storyboard document presents some interesting aspects of its construction and the idea behind it and also shows practically how, in simple steps, a user can enter his timetable criteria and receive a solution. The demo comprises showing the architecture of the system, the appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995